runtime.addrRange.base (field)

35 uses

	runtime (current package)
		mpagealloc.go#L469: 		for i := chunkIndex(r.base.addr()).l1(); i < chunkIndex(r.limit.addr()-1).l1(); i++ {
		mpagealloc_64bit.go#L110: 		sumIdxBase, sumIdxLimit := addrsToSummaryRange(level, r.base.addr(), r.limit.addr())
		mpagealloc_64bit.go#L179: 		sysMap(unsafe.Pointer(need.base.addr()), need.size(), p.sysStat)
		mpagealloc_64bit.go#L180: 		sysUsed(unsafe.Pointer(need.base.addr()), need.size(), need.size())
		mpagealloc_64bit.go#L235: 		sysMap(unsafe.Pointer(need.base.addr()), need.size(), sysStat)
		mpagealloc_64bit.go#L236: 		sysUsed(unsafe.Pointer(need.base.addr()), need.size(), need.size())
		mranges.go#L27: 	base, limit offAddr
		mranges.go#L43: 	if !a.base.lessThan(a.limit) {
		mranges.go#L48: 	return a.limit.diff(a.base)
		mranges.go#L53: 	return a.base.lessEqual(offAddr{addr}) && (offAddr{addr}).lessThan(a.limit)
		mranges.go#L61: 	if b.base.lessEqual(a.base) && a.limit.lessEqual(b.limit) {
		mranges.go#L63: 	} else if a.base.lessThan(b.base) && b.limit.lessThan(a.limit) {
		mranges.go#L65: 	} else if b.limit.lessThan(a.limit) && a.base.lessThan(b.limit) {
		mranges.go#L66: 		a.base = b.limit
		mranges.go#L67: 	} else if a.base.lessThan(b.base) && b.base.lessThan(a.limit) {
		mranges.go#L68: 		a.limit = b.base
		mranges.go#L77: 	base := alignUp(a.base.addr(), uintptr(align)) + len
		mranges.go#L81: 	a.base = offAddr{base}
		mranges.go#L90: 	if a.base.addr() > limit {
		mranges.go#L100: 	if (offAddr{addr}).lessEqual(a.base) {
		mranges.go#L106: 	return makeAddrRange(a.base.addr(), addr)
		mranges.go#L280: 		if base.lessThan(a.ranges[i].base) {
		mranges.go#L298: 		if base.lessThan(a.ranges[i].base) {
		mranges.go#L313: 		return a.ranges[0].base.addr(), true
		mranges.go#L319: 		return a.ranges[i].base.addr(), true
		mranges.go#L349: 		print("runtime: range = {", hex(r.base.addr()), ", ", hex(r.limit.addr()), "}\n")
		mranges.go#L354: 	i := a.findSucc(r.base.addr())
		mranges.go#L355: 	coalescesDown := i > 0 && a.ranges[i-1].limit.equal(r.base)
		mranges.go#L356: 	coalescesUp := i < len(a.ranges) && r.limit.equal(a.ranges[i].base)
		mranges.go#L372: 		a.ranges[i].base = r.base